Kakeya sets in finite affine spaces

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kakeya-type sets in finite vector spaces

For a finite vector space V and a non-negative integer r ≤ dim V we estimate the smallest possible size of a subset of V , containing a translate of every rdimensional subspace. In particular, we show that if K ⊆ V is the smallest subset with this property, n denotes the dimension of V , and q is the size of the underlying field, then for r bounded and r < n ≤ rq we have |V \K| = Θ(nq); this im...

متن کامل

On the Size of Kakeya Sets in Finite Vector Spaces

For a finite field Fq, a Kakeya set K is a subset of Fq that contains a line in every direction. This paper derives new upper bounds on the minimum size of Kakeya sets when q is even.

متن کامل

Overlapping Self-affine Sets of Kakeya Type

We compute the Minkowski dimension for a family of self-affine sets on R. Our result holds for every (rather than generic) set in the class. Moreover, we exhibit explicit open subsets of this class where we allow overlapping, and do not impose any conditions on the norms of the linear maps. The family under consideration was inspired by the theory of Kakeya sets.

متن کامل

M ar 2 01 0 KAKEYA - TYPE SETS IN FINITE VECTOR SPACES

For a finite vector space V and a non-negative integer r ≤ dim V we estimate the smallest possible size of a subset of V , containing a translate of every rdimensional subspace. In particular, we show that if K ⊆ V is the smallest subset with this property, n denotes the dimension of V , and q is the size of the underlying field, then for r bounded and r < n ≤ rq we have |V \K| = Θ(nq); this im...

متن کامل

Finite field Kakeya and Nikodym sets in three dimensions

We give improved lower bounds on the size of Kakeya and Nikodym sets over Fq. We also propose a natural conjecture on the minimum number of points in the union of a not-too-flat set of lines in Fq, and show that this conjecture implies an optimal bound on the size of a Nikodym set. Finally, we study the notion of a weak Nikodym set and give improved, and in some special cases optimal, bounds fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2011

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2010.03.007